PURSUING EFFICIENCY WHILE MAINTAINING OUTREACH: BANK PRIVATIZATION IN TANZANIA

Profitability improvements after the privatization of a large state-owned bank might come at the expense of reduced access to financial services for some groups, especially the rural poor. The privatization of Tanzania's National Bank of Commerce provides a unique episode for studying this issue. The bank was split into the "new" National Bank of Commerce, a commercial bank that assumed most of the original bank's assets and liabilities, and the National Microfinance Bank, which assumed most of the branch network and the mandate to foster access to financial services. The new National Bank of Commerce's profitability and portfolio quality improved although credit growth was slow, in line with privatization experiences in other developing countries. Finding a buyer for the National Microfinance Bank proved very difficult, although after years under contract management by private banking consultants, Rabobank of the Netherlands emerged as a purchaser. Profitability has since improved and lending has slowly grown, while the share of non-performing loans remains low.access to banking; access to banking services; access to financial services; access to services; Accounting; Agricultural Bank; asset allocation; asset portfolio; ATMs

Dismissive incomprehension: a use of purported ignorance to undermine others

This paper analyses a particular social phenomenon whereby a speaker purports ignorance of the meaning of another speaker’s speech in order to undermine that other speaker: dismissive incomprehension. It develops a speech act theory of the phenomenon, and develops its distinctive, and sometimes problematic perlocutionary character. After taking a look at some of the issues surrounding the phenomenon, the paper compares it to more fully studied features of our social lives, including epistemic injustice and gaslighting. It ends with some thoughts on counteracting the problematic cases of dismissive incomprehension

Probabilistic computation by neuromine networks

Abstract In this paper, we address the question, can biologically feasible neural nets compute more than can be computed by deterministic polynomial time algorithms? Since we want to maintain a claim of plausibility and reasonableness we restrict ourselves to algorithmically easy to construct nets and we rule out infinite precision in parameters and in any analog parts of the computation. Our approach is to consider the recent advances in randomized algorithms and see if such randomized computations can be described by neural nets. We start with a pair of neurons and show that by connecting them with reciprocal inhibition and some tonic input, then the steady-state will be one neuron ON and one neuron OFF, but which neuron will be ON and which neuron will be OFF will be chosen at random (perhaps, it would be better to say that microscopic noise in the analog computation will be turned into a megascale random bit). We then show that we can build a small network that uses this random bit process to generate repeatedly random bits. This random bit generator can then be connected with a neural net representing the deterministic part of randomized algorithm. We, therefore, demonstrate that these neural nets can carry out probabilistic computation and thus be less limited than classical neural nets

Validating automated screening for psychological distress by means of computer touchscreens for use in routine oncology practice

The aim of the study was to confirm the validity of using touchscreen computers for screening for clinically significant levels of distress among cancer patients in routine oncology practice. The Hospital Anxiety and Depression Scale (HADS), EORTC Quality of Life questionnaire (QLQ-C30), Mental Health Inventory-MHI5 and a Concerns Checklist were administered via touchscreen computer to 172 chemotherapy out-patients, twice, 2–4 weeks apart. A standard psychiatric interview (Present State Examination – PSE) was conducted within a week of the second assessment. On interview, 23% of patients were identified as ‘cases’. Using the available data (questionnaires, sociodemographic details, self-reported past psychiatric history), the best screening strategy combined scores from MHI-5 and HADS from a single time-point with the following rules: if MHI-5 < 11 = non-case; if MHI-5 ≥ 11 then use HADS; then, if HADS ≥ 9 = ‘case’ (sensitivity 85%; specificity 71%; misclassification rate 26%; positive predictive value 47%). The computerized screening system enabled data to be collected, scored, collated and reported in real time to identify patients who warrant further clinical assessment. It offers the potential for improving ‘case’ detection in routine oncology practice while reducing the burden of questions put to ‘non-cases’. Further work is needed to develop optimal choice of screening questions for this purpose. © 2001 Cancer Research Campaign http://www.bjcancer.co

New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces

Schellekens [The Smyth completion: A common foundation for denotational semantics and complexity analysis, Electron. Notes Theor. Comput. Sci. 1 (1995), pp. 211-232.] introduced the theory of complexity (quasi-metric) spaces as a part of the development of a topological foundation for the asymptotic complexity analysis of programs and algorithms in 1995. The applicability of this theory to the asymptotic complexity analysis of divide and conquer algorithms was also illustrated by Schellekens in the same paper. In particular, he gave a new formal proof, based on the use of the Banach fixed-point theorem, of the well-known fact that the asymptotic upper bound of the average running time of computing of Mergesort belongs to the asymptotic complexity class of n log(2) n. Recently, Schellekens' method has been shown to be useful in yielding asymptotic upper bounds for a class of algorithms whose running time of computing leads to recurrence equations different from the divide and conquer ones reported in Cerda-Uguet et al. [The Baire partial quasi-metric space: A mathematical tool for the asymptotic complexity analysis in Computer Science, Theory Comput. Syst. 50 (2012), pp. 387-399.]. However, the variety of algorithms whose complexity can be analysed with this approach is not much larger than that of algorithms that can be analysed with the original Schellekens method. In this paper, on the one hand, we extend Schellekens' method in order to yield asymptotic upper bounds for a certain class of recursive algorithms whose running time of computing cannot be discussed following the techniques given by Cerda-Uguet et al. and, on the other hand, we improve the original Schellekens method by introducing a new fixed-point technique for providing, contrary to the case of the method introduced by Cerda-Uguet et al., lower asymptotic bounds of the running time of computing of the aforementioned algorithms and those studied by Cerda-Uguet et al. We illustrate and validate the developed method by applying our results to provide the asymptotic complexity class (asymptotic upper and lower bounds) of the celebrated algorithms Quicksort, Largetwo and Hanoi.The authors are thankful for the support from the Spanish Ministry of Science and Innovation, grant MTM2009-12872-C02-01.Romaguera Bonilla, S.; Tirado Peláez, P.; Valero Sierra, Ó. (2012). New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces. International Journal of Computer Mathematics. 89(13-14):1728-1741. https://doi.org/10.1080/00207160.2012.659246S172817418913-14Cerdà-Uguet, M. A., Schellekens, M. P., & Valero, O. (2011). The Baire Partial Quasi-Metric Space: A Mathematical Tool for Asymptotic Complexity Analysis in Computer Science. Theory of Computing Systems, 50(2), 387-399. doi:10.1007/s00224-010-9310-7Cull, P., & Ecklund, E. F. (1985). Towers of Hanoi and Analysis of Algorithms. The American Mathematical Monthly, 92(6), 407. doi:10.2307/2322448García-Raffi, L. M., Romaguera, S., & Sánchez-Pérez, E. A. (2002). Sequence spaces and asymmetric norms in the theory of computational complexity. Mathematical and Computer Modelling, 36(1-2), 1-11. doi:10.1016/s0895-7177(02)00100-0García-Raffi, L. M., Romaguera, S., & Schellekens, M. P. (2008). Applications of the complexity space to the General Probabilistic Divide and Conquer Algorithms. Journal of Mathematical Analysis and Applications, 348(1), 346-355. doi:10.1016/j.jmaa.2008.07.026Künzi, H.-P. A. (2001). Nonsymmetric Distances and Their Associated Topologies: About the Origins of Basic Ideas in the Area of Asymmetric Topology. History of Topology, 853-968. doi:10.1007/978-94-017-0470-0_3Rodríguez-López, J., Romaguera, S., & Valero, O. (2008). Denotational semantics for programming languages, balanced quasi-metrics and fixed points. International Journal of Computer Mathematics, 85(3-4), 623-630. doi:10.1080/00207160701210653Rodríguez-López, J., Schellekens, M. P., & Valero, O. (2009). An extension of the dual complexity space and an application to Computer Science. Topology and its Applications, 156(18), 3052-3061. doi:10.1016/j.topol.2009.02.009Romaguera, S., & Schellekens, M. (1999). Quasi-metric properties of complexity spaces. Topology and its Applications, 98(1-3), 311-322. doi:10.1016/s0166-8641(98)00102-3Romaguera, S., & Valero, O. (2008). On the structure of the space of complexity partial functions. International Journal of Computer Mathematics, 85(3-4), 631-640. doi:10.1080/00207160701210117Romaguera, S., Schellekens, M. P., & Valero, O. (2011). The complexity space of partial functions: a connection between complexity analysis and denotational semantics. International Journal of Computer Mathematics, 88(9), 1819-1829. doi:10.1080/00207161003631885Schellekens, M. (1995). The Smyth Completion. Electronic Notes in Theoretical Computer Science, 1, 535-556. doi:10.1016/s1571-0661(04)00029-5Scott, D. S. 1970. Outline of a mathematical theory of computation. Proceedings of the 4th Annual Princeton Conference on Information Sciences and Systems. March26–271970, Princeton, NJ. pp.169–176

Acid-sensing ion channel 1a drives AMPA receptor plasticity following ischemia and acidosis in hippocampal CA1 neurons

The CA1 region of the hippocampus is particularly vulnerable to ischemic damage. While NMDA receptors play a major role in excitotoxicity, it is thought to be exacerbated in this region by two forms of post-ischemic AMPA receptor (AMPAR) plasticity - namely, anoxic long-term potentiation (a-LTP), and a delayed increase in the prevalence of Ca2+ -permeable GluA2-lacking AMPARs (CP-AMPARs). The acid-sensing ion channel 1a (ASIC1a) which is expressed in CA1 pyramidal neurons, is also known to contribute to post-ischemic neuronal death and to physiologically induced LTP. This raises the question - does ASIC1a activation drive the post-ischemic forms of AMPAR plasticity in CA1 pyramidal neurons? We have tested this by examining organotypic hippocampal slice cultures (OHSCs) exposed to oxygen glucose deprivation (OGD), and dissociated cultures of hippocampal pyramidal neurons (HPN) exposed to low pH (acidosis). We find that both a-LTP and the delayed increase in the prevalence of CP-AMPARs are dependent on ASIC1a activation during ischemia. Indeed, acidosis alone is sufficient to induce the increase in CP-AMPARs. We also find that inhibition of ASIC1a channels circumvents any potential neuroprotective benefit arising from block of CP-AMPARs. By demonstrating that ASIC1a activation contributes to post-ischemic AMPAR plasticity, our results identify a functional interaction between acidotoxicity and excitotoxicity in hippocampal CA1 cells, and provide insight into the role of ASIC1a and CP-AMPARs as potential drug targets for neuroprotection. We thus propose that ASIC1a activation can drive certain forms of CP-AMPAR plasticity, and that inhibiting ASIC1a affords neuroprotection

The effect of moderate intensity exercise in the postprandial period on the inflammatory response to a high-fat meal: an experimental study

Citation: Teeman, C. S., Kurti, S. P., Cull, B. J., Emerson, S. R., Haub, M. D., & Rosenkranz, S. K. (2016). The effect of moderate intensity exercise in the postprandial period on the inflammatory response to a high-fat meal: an experimental study. Nutrition Journal, 15, 13. doi:10.1186/s12937-016-0134-4Background: Consuming a high-fat meal (HFM) may lead to postprandial lipemia (PPL) and inflammation. Postprandial exercise has been shown to effectively attenuate PPL. However, little is known about the impact of postprandial exercise on systemic inflammation and whether PPL and inflammation are associated. The purpose of this study was to determine whether moderate intensity exercise performed 60 min following a true-to-life HFM would attenuate PPL and inflammation. Methods: Thirty-nine young adults (18-40 year) with no known metabolic disease were randomized to either a control group (CON) who remained sedentary during the postprandial period or an exercise (EX) group who walked at 60 % VO2peak to expend approximate to 5 kcal/kgbw one-hour following the HFM. Participants consumed a HFM of 10 kcal/kgbw and blood draws were performed immediately before, 2 h and 4 h post-HFM. Results: At baseline, there were no differences between EX and CON groups for any metabolic or inflammatory markers (p > 0.05). Postprandial triglycerides (TRG) increased from baseline to 4 h in the EX and CON groups (p 0.05). There was an increase in soluble vascular adhesion molecule (sVCAM-1) from baseline to 4 h (p = 0.027) for all participants along with a group x time interaction (p = 0.020). Changes in TRG were associated with changes in interleukin-10 (IL-10) from 0 to 2 h (p = 0.007), but were not associated with changes in any other inflammatory marker in the postprandial period (p > 0.05). Conclusions: Despite significant increases in PPL following a HFM, moderate intensity exercise in the postprandial period did not mitigate the PPL nor the inflammatory response to the HFM. These results indicate that in populations with low metabolic risk, PPL and inflammation following a HFM may not be directly related

Postprandial lipemic and inflammatory responses to high-fat meals: a review of the roles of acute and chronic exercise

Citation: Teeman, C. S., Kurti, S. P., Cull, B. J., Emerson, S. R., Haub, M. D., & Rosenkranz, S. K. (2016). Postprandial lipemic and inflammatory responses to high-fat meals: a review of the roles of acute and chronic exercise. Nutrition & Metabolism, 13, 14. doi:10.1186/s12986-016-0142-6Postprandial lipemia is an independent risk factor for development of cardiovascular disease. Postprandial inflammation following the prolonged elevation of triglycerides occurring subsequent to ingestion of high-fat meals, provides a likely explanation for increased disease risk. Substantial evidence has shown that acute exercise is an effective modality for attenuation of postprandial lipemia following a high-fat meal. However, much of the evidence pertaining to exercise intensity, duration, and overall energy expenditure for reducing postprandial lipemia is inconsistent. The effects of these different exercise variables on postprandial inflammation is largely unknown. Long-term, frequent exercise, however, appears to effectively reduce systemic inflammation, especially in at-risk or diseased individuals. With regard to an acute postprandial response, without a recent bout of exercise, high levels of chronic exercise do not appear to reduce postprandial lipemia. This review summarizes the current literature on postprandial and inflammatory responses to high-fat meals, and the roles that both acute and chronic exercise play. This review may be valuable for health professionals who wish to provide evidence-based, pragmatic advice for reducing postprandial lipemia and cardiovascular disease risk for their patients. A brief review of proposed mechanisms explaining how high-fat meals may result in pro-inflammatory and pro-atherosclerotic environments is also included

Does moderate intensity exercise attenuate the postprandial lipemic and airway inflammatory response to a high-fat meal?

Citation: Stephanie P. Kurti, Sara K. Rosenkranz, Morton Levitt, et al., “Does Moderate Intensity Exercise Attenuate the Postprandial Lipemic and Airway Inflammatory Response to a High-Fat Meal?,” BioMed Research International, vol. 2015, Article ID 647952, 10 pages, 2015. doi:10.1155/2015/647952We investigated whether an acute bout of moderate intensity exercise in the postprandial period attenuates the triglyceride and airway inflammatory response to a high-fat meal (HFM) compared to remaining inactive in the postprandial period. Seventeen (11 M/6 F) physically active (≥150 min/week of moderate-vigorous physical activity (MVPA)) subjects were randomly assigned to an exercise (EX; 60% VO[subscript 2peak]) or sedentary (CON) condition after a HFM (10 kcal/kg, 63% fat). Blood analytes and airway inflammation via exhaled nitric oxide (eNO) were measured at baseline, and 2 and 4 hours after HFM. Airway inflammation was assessed with induced sputum and cell differentials at baseline and 4 hours after HFM. Triglycerides doubled in the postprandial period (~113 ± 18%, P < 0.05 ), but the increase did not differ between EX and CON. Percentage of neutrophils was increased 4 hours after HFM (~17%), but the increase did not differ between EX and CON. Exhaled nitric oxide changed nonlinearly from baseline to 2 and 4 hours after HFM (P < 0.05, ƞ² = 0.36) . Our findings suggest that, in active individuals, an acute bout of moderate intensity exercise does not attenuate the triglyceride or airway inflammatory response to a high-fat meal